package pseudoAssemblerCompiler;

import pseudoAssemblerCompiler.twopassassembler.BinarySearchTree;
import pseudoAssemblerCompiler.twopassassembler.Node;
import pseudoAssemblerCompiler.twopassassembler.model.entities.OperationCode;

import java.util.HashMap;
import java.util.Map;

/**
 * Hello world!
 */
public class App {
//    public static void main(String[] args) {
//        System.out.println("Hello World!");
//
//        BinarySearchTree theTree = new BinarySearchTree(); // make a tree
//        theTree.insert(50, 1.5); // insert 3 nodes
//        theTree.insert(25, 4.4);
//        theTree.insert(75, 1.9);
//        Node found = theTree.find(25); // find node with key 25
//        if (found != null)
//            System.out.println("Found the node with key 25");
//        else
//            System.out.println("Could not find node with key 25");
//        System.out.println(theTree.delete(50));
//        System.out.println(theTree.delete(5));
//
//        Map<String, OperationCode> map = new HashMap<String, OperationCode>();
//        String strToParse = "JMP, 1, 2";
//        String[] arr = strToParse.split(", ");
//        String key = arr[0];
//        System.out.println(key.hashCode());
//        System.out.println("JMP".hashCode());
//        map.put(key, new OperationCode());
//        System.out.println(key.hashCode());
//        System.out.println(map.containsKey(key));
//
//    }
}
